Greedy Algorithms for Granular Computing Problems in Spatial Granulation Technique
نویسندگان
چکیده
منابع مشابه
INTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS
Representation of a granule, relation and operation between two granules are mainly researched in granular computing. Hyperbox granular computing classification algorithms (HBGrC) are proposed based on interval analysis. Firstly, a granule is represented as the hyperbox which is the Cartesian product of $N$ intervals for classification in the $N$-dimensional space. Secondly, the relation betwee...
متن کاملGreedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the minimum vertex cover (MVC), minimum independent dominating set (MIDS) and minimum edge dominating set (MEDS) problems. In almost all cases we are able to improve the best known results for these problems. Results for t...
متن کاملA Novel Greedy Computing Algorithm for Rectangle Packing Problems
Rectangle packing problem often appears in encasement and cutting as well as layout of homepage or newspaper, etc. This problem has been shown to be NP hard. For solving this problem, many compute algorithms based on different strategies are presented in the literatures. A novel-computing algorithm is proposed in this paper. The novel match algorithm tested the instances that taken from the lit...
متن کاملBottle Up Granular Computing Classification Algorithms
Shape of granule is one of the important issues in granular computing classification problems and related to the classification accuracy, the number of granule, and the join process of two granules. A bottle up granular computing classification algorithm (BUGrC) is developed in the frame work of fuzzy lattices. Firstly, the granules are represented as 4 shapes, namely hyperdiamond granule, hype...
متن کاملGreedy splitting algorithms for approximating multiway partition problems
Abstract. Given a system (V, T, f, k), where V is a finite set, T ⊆ V , f : 2 → R is a submodular function and k ≥ 2 is an integer, the general multiway partition problem (MPP) asks to find a k-partition P = {V1, V2, . . ., Vk} of V that satisfies Vi∩T 6= ∅ for all i and minimizes f(V1)+f(V2)+ · · ·+f(Vk), where P is a k-partition of V if (i) Vi 6= ∅, (ii) Vi ∩ Vj = ∅, i 6= j, and (iii) V1 ∪ V2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2017
ISSN: 1877-0509
DOI: 10.1016/j.procs.2017.01.112